Data Compression Based Accelerated Evolution
نویسندگان
چکیده
منابع مشابه
Hardware-Accelerated Data Compression in Low-Power Wireless Sensor Networks
In wireless sensor networks, the actual transmission of collected data is often the most energy-consuming operation. Frequently, it is worthwhile to spend energy aggregating the raw sensor data on the node to reduce the transmission effort. For many cases, lossless data compression can be employed as a general data aggregation method, as incompressible data (noise) generally does not carry any ...
متن کاملCUDA-Accelerated HD-ODETLAP: Lossy High Dimensional Gridded Data Compression
We present High-dimensional Overdetermined Laplacian Partial Differential Equations (HD-ODETLAP), a high dimensional lossy compression algorithm and CUDA implementation that exploits data correlations across multiple dimensions of gridded GIS data. Exploiting the GPU gives a considerable speedup. In addition, HD-ODETLAP compresses much better than JPEG2000 and 3D-SPIHT, when fixing either the a...
متن کاملHardware Accelerated Compression of LIDAR Data Using FPGA Devices
Airborne Light Detection and Ranging (LIDAR) has become a mainstream technology for terrain data acquisition and mapping. High sampling density of LIDAR enables the acquisition of high details of the terrain, but on the other hand, it results in a vast amount of gathered data, which requires huge storage space as well as substantial processing effort. The data are usually stored in the LAS form...
متن کاملCompression and Accelerated Rendering of Time-Varying Volume Data
Visualization of time-varying volumetric data sets, which may be obtained from numerical simulations or sensing instruments, provides scientists insights into the detailed dynamics of the phenomenon under study. This paper describes our study of a coherent solution based on quantization coupled with octree and difference encoding, and adaptive rendering for efficient visualization of timevaryin...
متن کاملPattern Based Lossless Data Compression
In this paper we discuss a method for lossless data compression (LDC) which relies on finding a set of patterns (each of these patterns will be called a metasymbol) in a set of data whose elements (which we will call symbols) are of arbitrary size and which is, itself, also of arbitrary size. This arbitrary data set will be called a message. In order to achieve LDC two things are necessary: a) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science & Systems Biology
سال: 2017
ISSN: 0974-7230
DOI: 10.4172/jcsb.1000243